Digital Coins based on Hash Chain

نویسندگان

  • Khanh Quoc Nguyen
  • Yi Mu
  • Vijay Varadharajan
چکیده

We propose three digital coin schemes for doing electronic transactions over the Internet. These schemes are based on one-way hash functions. The rst scheme uses an ordinary one-way single hash function chain, which forms the basis of a simple micropayment scheme. The second scheme is based on a new technique called double-locked hash chain technique which overcomes some of the drawbacks found in single hash chain schemes. The third micropayment scheme presents a method to achieve client anonymity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Study of Micro-payment Based on One-way Hash Chain

Electronic payment systems have gradually become an important issue nowadays because of the popularity and importance of electronic commerce on the Internet. Security and convenience related topics are the most important issues that concern people. The electronic micropayment is one of the most popular research topics on electronic commerce. Recently, many efficient micropayment schemes, based ...

متن کامل

An Improved Hash Function Based on the Tillich-Zémor Hash Function

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

متن کامل

Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?

Many cryptographic primitives begin with parameter generation, which picks a primitive from a family. Such generation can use public coins (e.g., in the discrete-logarithm-based case) or secret coins (e.g., in the factoring-based case). We study the relationship between public-coin and secret-coin collision-resistant hash function families (CRHFs). Specifically, we demonstrate that: • there is ...

متن کامل

An online algorithm for generating fractal hash chains applied to digital chains of custody

This paper gives an online algorithm for generating Jakobsson’s fractal hash chains [14]. Our new algorithm compliments Jakobsson’s fractal hash chain algorithm for preimage traversal since his algorithm assumes the entire hash chain is precomputed and a particular list of ⌈logn⌉ hash elements or pebbles are saved. Our online algorithm for hash chain traversal incrementally generates a hash cha...

متن کامل

Undeniable Mobile Billing Schemes

An undeniable mobile billing system allows a mobile network service provider to bill its subscribers with trustworthy evidences. Chen, Jan and Chen proposed such a billing system by introducing a trusted third party – Observer and exploiting a hash chain mechanism. In their system, the Observer provides call time evidence to both cellular carriers and subscribers for billing. In this paper, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997